/*
 * @lc app=leetcode.cn id=2300 lang=csharp
 *
 * [2300] 咒语和药水的成功对数
 */

// @lc code=start
public class Solution {
    public int[] SuccessfulPairs(int[] spells, int[] potions, long success) {
        int[] pairs = new int[spells.Length];
        for (int i = 0; i < spells.Length; i++)
        {
            pairs[i] = 0;
            var power = spells[i];
            if(power == 0){continue;}
            for (int j = 0; j < potions.Length; j++)
            {
                if (power * potions[j] >= success)
                {
                    pairs[i]++;
                }
            }
        }
        return pairs;
    }
}
// @lc code=end

